Landmark-Based Ensemble Learning with Random Fourier Features and Gradient Boosting

نویسندگان

چکیده

This paper jointly leverages two state-of-the-art learning stra-tegies—gradient boosting (GB) and kernel Random Fourier Features (RFF)—to address the problem of learning. Our study builds on a recent result showing that one can learn distribution over RFF to produce new suited for task at hand. For this distribution, we exploit GB scheme expressed as ensembles weak learners, each them being function designed fit residual. Unlike Multiple Kernel Learning techniques make use pre-computed dictionary functions select from, iteration by approximating it from training data weighted sum RFF. strategy allows build classifier based small ensemble learned “landmarks” better underlying application. We conduct thorough experimental analysis highlight advantages our method compared both boosting-based kernel-learning methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CatBoost: gradient boosting with categorical features support

In this paper we present CatBoost, a new open-sourced gradient boosting library that successfully handles categorical features and outperforms existing publicly available implementations of gradient boosting in terms of quality on a set of popular publicly available datasets. The library has a GPU implementation of learning algorithm and a CPU implementation of scoring algorithm, which are sign...

متن کامل

Wavelet-based gradient boosting

A new data science tool named wavelet-based gradient boosting is proposed and tested. The approach is special case of componentwise linear least squares gradient boosting, and involves wavelet functions of the original predictors.Wavelet-based gradient boosting takes advantages of the approximate 1 penalization induced by gradient boosting to give appropriate penalized additive fits. The method...

متن کامل

Gradient Boosting for Conditional Random Fields

Gradient Boosting for Conditional Random Fields Report Title In this paper, we present a gradient boosting algorithm for tree-shaped conditional random fields (CRF). Conditional random fields are an important class of models for accurate structured prediction, but effective design of the feature functions is a major challenge when applying CRF models to real world data. Gradient boosting, which...

متن کامل

Practical Learning of Deep Gaussian Processes via Random Fourier Features

The composition of multiple Gaussian Processes as a Deep Gaussian Process (DGP) enables a deep probabilistic approach to flexibly quantify uncertainty and carry out model selection in various learning scenarios. In this work, we introduce a novel formulation of DGPs based on random Fourier features that we train using stochastic variational inference. Our proposal yields an efficient way of tra...

متن کامل

Learning Random Fourier Features by Hybrid Constrained Optimization

The kernel embedding algorithm is an important component for adapting kernel methods to large datasets. Since the algorithm consumes a major computation cost in the testing phase, we propose a novel teacher-learner framework of learning computation-efficient kernel embeddings from specific data. In the framework, the highprecision embeddings (teacher) transfer the data information to the comput...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-67664-3_9